The multi-depot k-traveling repairman problem

Abstract In this paper, we study the multi-depot k -traveling repairman problem. This problem extends traditional traveling to case. Its objective, similar single depot variant, is minimization of sum arrival times customers. We propose two distinct formulations model problem, obtained on layered graphs. order find feasible solutions for largest instances, a hybrid genetic algorithm where initial are built using splitting heuristic and local search embedded into algorithm. The efficiency mathematical solution approach investigated through computational experiments. proposed models scalable enough solve instances up 240